Deterministic Parallel DPLL
نویسندگان
چکیده
Current parallel SAT solvers suffer from a non-deterministic behavior. This is the consequence of their architectures which rely on weak synchronizing in an attempt to maximize performance. This behavior is a clear downside for practitioners, who are used to both runtime and solution reproducibility. In this paper, we propose the first Deterministic Parallel DPLL engine. Our experimental results clearly show that our approach preserves the performance of the parallel portfolio approach while ensuring full reproducibility of the results.
منابع مشابه
Exploiting Unexploited Computing Resources for Computational Logics
We present an investigation of the use of GPGPU techniques to parallelize the execution of a satisfiability solver, based on the traditional DPLL procedure—which, in spite of its simplicity, still represents the core of the most competitive solvers. The investigation tackles some interesting problems, including the use of a predominantly data-parallel architecture, like NVIDIA’s CUDA platform, ...
متن کاملSAT-Solving: Performance Analysis of Survey Propagation and DPLL
The Boolean Satisfiability Problem (SAT) belongs to the class of NP-complete problems, meaning that there is no known deterministic algorithm that can solve an arbitrary problem instance in less than exponential time (parametrized on the length of the input). There is great industrial demand for solving SAT, motivating the need for algorithms which perform well. I present a comparison of two ap...
متن کاملNew upper bound for the #3-SAT problem
We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms. The algorithm achieves a running time of O(1.6423) in the worst case which improves the current best bound of O(1.6737) by Dahllöf et al.
متن کاملDesign of variable loop gains of dual-loop DPLL
An approach to the derivation of variable loop gain sequences of dual-loop digital phase-locked loop (DPLL) [1] is developed based on some modifications of the Kalman filtering formulation. It is shown that optimal loop gain sequences which are independent of measurement noise statistics can be obtained under a deterministic source model. Computer simulation results demonstrate that the adaptiv...
متن کاملProject Milestone #2
I am interested in combining and parallelizing multiple search techniques. For my class project, I am combining portfolio-based DPLL SAT solving with Hyperresolution. Specifically, I am building on top of a system started by Erik Zawadzki and myself; I am incorporating our highly parallel DPLL+Resolution code into the relatively untried portfolio-based parallel solver called ManySAT [7], which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSAT
دوره 7 شماره
صفحات -
تاریخ انتشار 2011